Model Checking. Part II
نویسنده
چکیده
(Def. 1) CastNatx = { x, if x is a natural number, 0, otherwise. Let W1 be a set. A sequence of W1 is a function from N into W1. For simplicity, we use the following convention: k, n denote natural numbers, a denotes a set, D, S denote non empty sets, and p, q denote finite sequences of elements of N. Let us consider n. The functor atom. n yields a finite sequence of elements of N and is defined as follows: (Def. 2) atom. n = 〈6 + n〉. Let us consider p. The functor ¬p yields a finite sequence of elements of N and is defined as follows: (Def. 3) ¬p = 〈0〉 a p. Let us consider q. The functor p ∧ q yielding a finite sequence of elements of N is defined by: (Def. 4) p ∧ q = 〈1〉 a p a q. The functor p∨q yielding a finite sequence of elements of N is defined as follows:
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملA Verification Environment for I / O Automata – Part II : Theorem Proving and Model Checking – Olaf
We describe a veriication framework for I/O automata in Isabelle. It includes a temporal logic, proof support for showing implementation relations between live I/O automata, and a combination of Isabelle with model checking via a veriied abstraction theory. The underlying domain-theoretic sequence model turned out to be especially adequate for these purposes. Furthermore, using a tailored combi...
متن کاملA Verification Environment for I / O Automata – Part I : Temporal Logic and Abstraction – Olaf
I/O automata are used to specify and reason about distributed, reactive systems. In this paper we extend standard I/O automata by a theory of abstraction. The intention is to combine theorem proving and model checking. Verifying both temporal properties and implementation relations is reduced to nite-state model checking. Even for livenness proofs merely simple rst-order proof obligations remai...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملModel Checking of Restricted CTL* Formulas using ALCK
Introduction The purpose of model checking technique is to verify whether the implemented computer program (the model) satisfies the specified requirements (the formulas). Now letK be the Kripke model representing the behavior of the system and R be the set of formulas. The model checking process verifies whether every formula in R is satisfied by the model, which has I as the set of initial st...
متن کاملModel Checking Games in GDL-II
The game description language GDL has been developed as a logicbased formalism for representing the rules of arbitrary games in general game playing. A recent language extension called GDL-II allows the description of nondeterministic games with any number of players who may have incomplete, asymmetric information. In this paper, we apply model checking to address the problem of verifying that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formalized Mathematics
دوره 16 شماره
صفحات -
تاریخ انتشار 2008